Complexity theory - PDFSEARCH.IO - Document Search Engine

Complexity theory
Results: 3600

#	Item
801	Open Problems in Parameterized and Exact Computation — IWPEC 2008 Hans L. Bodlaender Erik D. Demaine Michael R. Fellows Jiong Guo Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-10-14 09:04:12 NP-complete problems Parameterized complexity Kernelization Path decomposition Clique Tree decomposition Vertex cover Dominating set Edge coloring Graph theory Theoretical computer science Mathematics
802	CS 373: Combinatorial Algorithms, Fall 2000 Homework 6 (due December 7, 2000 at midnight) Name: Net ID: Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 08:48:14 NP-complete problems Complexity classes NP-complete NP-hard NP Maximum cut Shortest path problem Travelling salesman problem P-complete Theoretical computer science Computational complexity theory Mathematics
803	Proceedings of Coordination 2004: Sixth International Conference on Coordination Models and Languages, Pisa, 2004 Problem Frames: a Case for Coordination L. Barroca1, J.L. Fiadeiro2, M. Jackson1, R. Laney1 and B.Nuseibe Add to Reading List Source URL: mcs.open.ac.uk Language: English - Date: 2003-12-02 10:42:24 Systems theory Systems engineering Problem frames approach Systems analysis Domain Complexity Architecture description language Software development Software requirements Software
804	Structural Decomposition Methods and What They are Good For Markus Aschinger1 , Conrad Drescher1 , Georg Gottlob1,2 , Peter Jeavons1 , and Evgenĳ Thorstensen1 1 Computing Laboratory, University of Oxford 2 Oxford Man In Add to Reading List Source URL: www.cs.ox.ac.uk Language: English - Date: 2013-06-06 21:34:11 Graph operations Tree decomposition Decomposition method Path decomposition Parameterized complexity Constraint satisfaction problem Bipartite graph Hypertree Hypergraph Graph theory Theoretical computer science Constraint programming
805	CS 373: Combinatorial Algorithms, Spring 2001 http://www-courses.cs.uiuc.edu/~cs373 Homework 6 (due Tue. May 1, 2001 at 11:59.99 p.m.) Name: Net ID: Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 08:52:35 NP-complete problems Complexity classes NP-complete NP-hard NP Travelling salesman problem Vertex cover Maximum cut Shortest path problem Theoretical computer science Computational complexity theory Mathematics
806	A Casual Tour Around a Circuit Complexity Bound∗ arXiv:1111.1261v1 [cs.CC] 4 Nov 2011 Ryan Williams† Add to Reading List Source URL: arxiv.org Language: English - Date: 2011-11-07 20:15:16 Complexity classes NTIME Circuit complexity P Bounded-error probabilistic polynomial Cook–Levin theorem Time hierarchy theorem NEXPTIME Time complexity Theoretical computer science Computational complexity theory Applied mathematics
807	Microsoft Word - sciencereviewdrtaneredis.doc Add to Reading List Source URL: coalitionforscience.org Language: English - Date: 2005-05-03 10:25:59 Religious controversies Intelligent design movement Evolutionary biology Science Evolution as fact and theory Denialism Irreducible complexity Scientific literacy Answers in Genesis Creationism Creationist objections to evolution Pseudoscience
808	16 CHAPTER 2. LEADER ELECTION of each node has the same structure. We will now show that non-uniform anonymous leader election for synchronous rings is impossible. The idea is that Add to Reading List Source URL: dcg.ethz.ch Language: English - Date: 2014-09-26 08:28:48 Distributed data storage Analysis of algorithms Probabilistic complexity theory Randomized algorithm Distributed algorithm Graph coloring Leader election Distributed computing Consensus Theoretical computer science Mathematics Computational complexity theory
809	Dynamics of Algorithmic Processing in Computer Systems Add to Reading List Source URL: www.complex-systems.com Language: English - Date: 2012-06-20 13:21:03 Analysis of algorithms Computational complexity theory Sorting algorithms Algorithm Complexity Best worst and average case Insertion sort Worst-case complexity Distributed computing Theoretical computer science Applied mathematics Mathematics
810	CCCG 2006, Kingston, Ontario, August 14–16, 2006 On Bipartite Matching under the RMS Distance Pankaj K. Agarwal∗ Abstract Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-27 22:59:06 Analysis of algorithms Computational complexity theory Time complexity Ordinal number Matching Euclidean algorithm Symbol Theoretical computer science Applied mathematics Mathematics

UPDATE